On parameters of subfield subcodes of extended norm-trace codes
نویسندگان
چکیده
In this article we describe how to find the parameters of subfield subcodes of extended Norm–Trace codes. With a Gröbner basis of the ideal of the Fqr rational points of the Norm–Trace curve one can determine the dimension of the subfield subcodes or the dimension of the trace code. We also find a BCH–like bound from the minimum distance of the original supercode. AMS Subject Classification: Primary: 14G50, 11,T71 Secondary: 13P10
منابع مشابه
A Linear Algebraic Approach to Subfield Subcodes of GRS Codes
The problem of finding subfield subcodes of generalized Reed–Solomon (GRS) codes (i.e., alternant codes) is considered. A pure linear algebraic approach is taken in order to derive message constraints that generalize the well known conjugacy constraints for cyclic GRS codes and their Bose– Chaudhuri–Hocquenghem (BCH) subfield subcodes. It is shown that the presented technique can be used for fi...
متن کاملQuantum codes from affine variety codes and their subfield-subcodes
We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure we get codes with good parameters, some of them exceeding the quantum Gilbert-Varshamov bound given by Feng and Ma.
متن کاملA class of linear codes with good parameters from algebraic curves
A class of linear codes with good parameters is constructed in this correspondence. It turns out that linear codes of this class are subcodes of the subfield subcodes of Goppa’s geometry codes. In particular, we find 61 improvements on Brouwer’s table [1] based on our codes.
متن کاملNew binary and ternary LCD codes
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3. Hence, the study of LCD codes is mainly open for binary and ternary fields. Subfield-subcodes of $J$-affine variety codes are a generalization of B...
متن کاملGeneralized subspace subcodes with application in cryptology
Most of the codes that have an algebraic decoding algorithm are derived from the Reed Solomon codes. They are obtained by taking equivalent codes, for example the generalized Reed Solomon codes, or by using the so-called subfield subcode method, which leads to Alternant codes and Goppa codes over the underlying prime field, or over some intermediate subfield. The main advantages of these constr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Adv. in Math. of Comm.
دوره 11 شماره
صفحات -
تاریخ انتشار 2017